Primitive 2-structures with the (n-2)-propertyBONIZZONI, P.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 151-178, issn 0304-3975Article

An algorithm for the modular decomposition of hypergraphsBONIZZONI, P; DELLA VEDOVA, G.Journal of algorithms (Print). 1999, Vol 32, Num 2, pp 65-86, issn 0196-6774Article

On automata on infinite treesBONIZZONI, P; MAURI, G.Theoretical computer science. 1992, Vol 93, Num 2, pp 227-244, issn 0304-3975Article

ASPicDB : A database resource for alternative splicing analysisCASTRIGNANO, T; D'ANTONIO, M; PICARDI, E et al.Bioinformatics (Oxford. Print). 2008, Vol 24, Num 10, pp 1300-1304, issn 1367-4803, 5 p.Article

Approximating the maximum isomorphic agreement subtree is hardBONIZZONI, P; DELLA VEDOVA, G; MAURI, G et al.Lecture notes in computer science. 2000, pp 119-128, issn 0302-9743, isbn 3-540-67633-3Conference Paper

Separating some splicing modelsBONIZZONI, P; FERRETTI, C; MAURI, G et al.Information processing letters. 2001, Vol 79, Num 6, pp 255-259, issn 0020-0190Article

Linear splicing and syntactic monoidBONIZZONI, P; DE FELICE, C; MAURI, G et al.Discrete applied mathematics. 2006, Vol 154, Num 3, pp 452-470, issn 0166-218X, 19 p.Article

On the power of circular splicingBONIZZONI, P; DE FELICE, C; MAURI, G et al.Discrete applied mathematics. 2005, Vol 150, Num 1-3, pp 51-66, issn 0166-218X, 16 p.Article